Reed Solomon Codes Against Adversarial Insertions and Deletions
نویسندگان
چکیده
In this work, we study the performance of Reed–Solomon codes against adversarial insertion-deletion (insdel) errors. We prove that over fields size $n^{O(k)}$ there are notation="LaTeX">$[n,k]$ Reed-Solomon can decode from notation="LaTeX">$n-2k+1$ insdel errors and hence attain half-Singleton bound. also give a deterministic construction such much larger (of notation="LaTeX">$n^{k^{O(k)}}$ ). Nevertheless, for notation="LaTeX">$k=O(\log n /\log \log n)$ our runs in polynomial time. For special case notation="LaTeX">$k=2$ , which received lot attention literature, construct an notation="LaTeX">$[n], [2]$ code field notation="LaTeX">$O(n^{4})$ notation="LaTeX">$n-3$ Earlier constructions required exponential size. Lastly, any requires notation="LaTeX">$\Omega (n^{3})$ .
منابع مشابه
Quantum Reed-Solomon Codes
During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [8]) and finding pre– images of an n–ary Boolean function (“searching”) in time O( √ 2n) (see [5]). Quantum computers are not only of theoretical nature—there are several suggestions how t...
متن کاملParallel Reed-Solomon Codes
The compound and integrated parallel Reed-Solomon (RS) codes for multichannel communication systems are suggested. The matrix model of errors for such codes is investigated. Methods of coding and decoding of parallel RS codes, and also methods of increase of their error correcting capability are developed.
متن کاملNotes on Reed-solomon Codes
Reed-Solomon codes are examples of error correcting codes, in which redundant information is added to data so that it can be recovered reliably despite errors in transmission or storage and retrieval. The error correction system used on CD’s and DVD’s is based on a Reed-Solomon code. These codes are also used on satellite links and other communications systems. We will first discuss the general...
متن کاملCounting generalized Reed-Solomon codes
In this article we count the number of [n, k] generalized Reed– Solomon (GRS) codes, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of [n, 3] MDS codes with n = 6, 7, 8, 9.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3237711